如果您这样做了，请设计一个幂等(idempotent)方法：也就是说，无论这个方式是被调用一次还是十次，确保它总是实现相同的功能。

If you do this, design the method to be idempotent: That is, make sure it does exactly the same thing whether it's invoked once or a dozen times.

youdao

例如，GET、POST和DELETE方法是等幂的，即多次执行它们与执行一次的结果相同。

For example, the GET, PUT, and DELETE methods are idempotent, meaning that the result of executing them multiple times is the same as that of executing them once.

youdao

该方法不需要安全或者等幂。

This method does not need to be either safe or idempotent.

youdao

借助牛顿公式和韦达定理，采用迭代的方法求解类似于自然数等幂和的问题。

With the help of Newton formula and Vieta theorem, iterative method was used to solve problems of power sum.

youdao

有时使一个方法安全也就是使它等幂。

Sometimes making a method safe also makes it idempotent.

youdao

GET方法应该是等幂的，意味着它可以安全地重复。

The GET method should also be idempotent, meaning that it can be safely repeated.

youdao

当有限域的特征不整除群的阶时，给出了直接写出相应的多项式环的本原幂等元的方法，从而可以直接写出所有的极小循环码。

In the case of(Char(F_q), |G|)=1, we provide a method that writing down directly all the primitive idempotents of related polynomial ring, and hence that of all the minimum cyclic codes.

youdao

当有限域的特征不整除群的阶时，给出了直接写出相应的多项式环的本原幂等元的方法，从而可以直接写出所有的极小循环码。

In the case of(Char(F_q), |G|)=1, we provide a method that writing down directly all the primitive idempotents of related polynomial ring, and hence that of all the minimum cyclic codes.

youdao