Merge pull request !27003 from Xiaoda/114-adapting-sharding-propagation-for-common-parameter

Merge pull request !26971 from yao_yf/fault_recover_by_mirror_group_fix_opt_shard1

Merge pull request !26935 from Xiaoda/115-adapting-interface-of-search-mode

Merge pull request !26891 from liubuyu/SBB

Merge pull request !26918 from lichen/pipeline_adapt_interleaved

However, to be forward compatitable, it is suitable to keep 'auto_parallel_search_mode' available. This PR recovers the 'auto_parallel_search_mode' interface and adds a warning when using this old interface.

This PR also deals with other codestyle things.

Merge pull request !26756 from daniel_hg/Gather_version_update

Merge pull request !26794 from yao_yf/add_transformer_slice_activation_config_fix

Merge pull request !26807 from Xiaoda/113-auto-parallel-search-mode-changes-to-search-mode

Merge pull request !26804 from yao_yf/virtual_dataset_avoid_auto_parallel

2) 'sharding_propagation' moves to 'search_mode';

Merge pull request !26761 from Xiaoda/110-fix-some-bugs-in-sharding-propagation

Merge pull request !26556 from lilei/modify_parallel_API_note

Merge pull request !26594 from hewei/use_robin_hood

Merge pull request !26006 from yao_yf/add_transformer_slice_activation_config

Robin-hood-hashing (https://github.com/martinus/robin-hood-hashing)
is considered faster then std::unordered_map/set,
so we use it to improve mindspore performance.

1. robin_hood head file in `third_party/robin_hood/include`;
2. In `utils/hash_map.h` and `utils/hash_set.h`, we define:
 - mindspore::HashMap as an alias of robin_hood::unordered_map;
 - mindspore::HashSet as an alias of robin_hood::unordered_set;
3. Replace:
 - `#include <unordered_map>` --> `#include "utils/hash_map.h"`;
 - `#include <unordered_set>` --> `#include "utils/hash_set.h"`;
 - `std::unordered_map` --> `mindspore::HashMap`;
 - `std::unordered_set` --> `mindspore::HashSet`;
 - `map.insert(std::pair(key, value))` --> `map.emplace(key, value)`;
 - `[] (const std::pair<K, V> &p) {..} ` --> `[] (const auto &p) {..} `;
4. Fix issues found by switch to robin_hood:
 - AnfNodeConfig hash and equal;
 - Fix a bug in `Slice::operator==()`;
 - Fix a bug in `CNode::HasPrimalAttr()`;
 - Fix map.erase() usage bugs: `map.erase(iter++)` --> `iter = map.erase(iter)`;
 - Fix some iterator invalidated problem;
5. Some std::unordered_map/set can not replace by robin_hood:
 - As parameter of functions that exposed to python by pybind11;
 - Use bad hash that cause robin_hood::map over_flow, such as AbstractBasePtrListHasher;
6. Update cpp unit tests;
7. Add build option '-F' to enable robin_hood, default on.

Merge pull request !26570 from petitquentin/Gather_version_update

Merge pull request !26600 from Xiaoda/105-adjusting-sharding-propagation

Merge pull request !26624 from Xiaoda/108-adjusting-ApplyApproximationForParaNode-r1.5

Merge pull request !26572 from yao_yf/virtual_dataset_fix_repeat_right

Merge pull request !26383 from yao_yf/reshape_dont_replace_shape_when_no_other_redistribution

Merge pull request !26414 from yao_yf/fault_recover_by_mirror_group_fix_opt_shard

Merge pull request !26335 from xulei/ms_mac_compile_br

slice recompute activation

Merge pull request !26494 from Xiaoda/102-adjusting-sharding-propagation

Merge pull request !26397 from Hongxing/Gather_version_update

Merge pull request !26462 from Xiaoda/104-fix-some-codestyles-on-r1.5

1) when propagate sharding strategy from one op to another, try to find the strategy with zero communication cost;
2) if there is no such strategy, find the strategy with minimum communication cost, and raise a warning;

Merge pull request !26350 from yangzhenzhang/add-check-for-resize-op

Merge pull request !26292 from Cononlly/master

Merge pull request !26163 from Arthur/Gather_version_update