// findUnusedDeposedKey generates a unique DeposedKey that is guaranteed not to
// already be in use for this instance.
findUnusedDeposedKey generates a unique DeposedKey that is guaranteed not to
already be in use for this instance.
// findUnusedDeposedKey generates a unique DeposedKey that is guaranteed not to // already be in use for this instance .
func (i *ResourceInstance) findUnusedDeposedKey() DeposedKey {
	for {
		key := NewDeposedKey()
		if _, exists := i.Deposed[key]; !exists {
			return key
		}
	}
}
func ( i * ResourceInstance ) findUnusedDeposedKey ( ) DeposedKey { for { key := NewDeposedKey ( ) if _ , exists := i . Deposed [ key ] ; ! exists { return key } } }
findUnusedDeposedKey generates a unique DeposedKey that is guaranteed not to
already be in use for this instance.
findUnusedDeposedKey generates a unique DeposedKey that is guaranteed not to already be in use for this instance .
// Spin until we find a unique one. This shouldn't take long, because // we have a 32-bit keyspace and there's rarely more than one deposed // instance.