Function bsp_job_node_0

dlib/test/bsp.cpp:432–466

    void bsp_job_node_0 (
        bsp_context& context,
        double& min_value,
        double& optimal_x
    )
    {
        double left = -100;
        double right = 100;

        min_value = std::numeric_limits<double>::infinity();
        double interval_width = std::abs(right-left);

        // This is doing a BSP based grid search for the minimum of f().  Here we 
        // do 100 iterations where we keep shrinking the grid size.
        for (int i = 0; i < 100; ++i)
        {
            context.broadcast(left);
            context.broadcast(right);

            for (unsigned int k = 1; k < context.number_of_nodes(); ++k)
            {
                std::pair<double,double> val;
                context.receive(val);
                if (val.second < min_value)
                {
                    min_value = val.second;
                    optimal_x = val.first;
                }
            }

            interval_width *= 0.5;
            left  = optimal_x - interval_width/2;
            right = optimal_x + interval_width/2;
        }
    }


    void bsp_job_other_nodes (