backtracking

英 [ˈbæktrækɪŋ]

美 [ˈbæktrækɪŋ]

v.  原路返回; 折回; 折返; (屈于压力而)改变声明(或主张)，出尔反尔; 退缩
backtrack的现在分词

现在分词：backtracking　

计算机

COCA.43330

柯林斯词典

• VERB 改变（说法、决定等）；出尔反尔
  If youbacktrack ona statement or decision you have made, you do or say something that shows that you no longer agree with it or support it.
  1. The committee backtracked by scrapping the controversial bonus system...
     委员会改变主意，放弃了有争议的奖金制度。
  2. The finance minister backtracked on his decision.
     财政部长收回了他的决定。
• VERB 原路返回
  If youbacktrack, you go back along a path or route you have just used.
  1. Leonard jumped in his car and started backtracking...
     伦纳德跳进车里，开始原路折返。
  2. We had to backtrack to the corner and cross the street.
     我们不得不原路返回到拐角处过街。
• VERB 倒回（描述或解释内容）
  If youbacktrackin an account or explanation, you talk about things which happened before the ones you were previously talking about.
  1. Can we just backtrack a little bit and look at your primary and secondary education?
     我们能不能回过头来谈谈你的小学和中学教育？

双语例句

• To help you catch runaway backtracking early, always test your regexes with long strings that contain partial matches.
  为帮助你早日把握回溯失控，总是用包含特殊匹配的长字符串测试你的正则表达式。
• In a large storage area, the use of tunnels and cross aisles reduces travel time and minimizes backtracking.
  在一个大型的存储区域，使用隧道和跨过道减少旅行时间和最大限度地减少回溯。
• The Bad: Action elements are sometimes poorly implemented with lots of backtracking; characters can level unevenly.
  缺点：（戏的）作规则有时候在许多回溯进程上会执行的不彻底（翻译，需要懂行的、过的朋友指正）角色的等级不平衡。
• However, backtracking is computationally expensive and can easily get out of hand if you're not careful.
  然而，回溯计算代价昂贵，如果你不够小心的话容易失控。
• In this column, you've seen how rules can be used as part of a hybrid approach that also includes search with backtracking.
  在本专栏中，您了解了如何在包含搜索和回溯功能的混合方法中使用规则。
• That's one reason for this chapter's lengthy backtracking coverage.
  这也是本章长篇大论回溯的原因之一。
• For example, top-down parsers are guaranteed to find every possible production, but can be extremely slow because of frequence ( exponention order) backtracking.
  例如，top-down解析器可以确保找到每一个可能的产品，但可能会非常慢，因为要频繁地（指数级）进行回溯。
• This next example shows how backtracking works with repetition quantifiers.
  下一个例子显示了带重复量词的回溯。
• The engine will discard all backtracking positions.
  引擎会忽略所有的回溯位置。
• In graph theory, to getting shortest path must compare all possible path, basically use backtracking, the Algorithm needs longer time.
  在图论中，一般求最短路径都是通过比较各种可能的路径后而得到的，基本上都是按树的回溯方式求得。