Datadog agent changelog : https://github.com/DataDog/datadog-agent/blob/main/CHANGELOG.rst
Datadog helm chart changelog : https://github.com/DataDog/helm-charts/blob/main/charts/datadog/CHANGELOG.md
Datadog helm chart readme : https://github.com/DataDog/helm-charts/tree/main/charts/datadog
FIrst edit your A chart to not include the resource, and add the keep annontation
https://helm.sh/docs/howto/charts_tips_and_tricks/#tell-helm-not-to-uninstall-a-resource
annotations:
"helm.sh/resource-policy": keep
From this point, your resource is not managed by helm anymore
Clean the resource (annotations...)
Then import the resource so it's managed by B chart
https://jacky-jiang.medium.com/import-existing-resources-in-helm-3-e27db11fd467
It's worth to think about your rollup/aggregation strategy
For metrics-like errors, its better to show the worst case scenario with max/max
https://medium.com/omio-engineering/cpu-limits-and-aggressive-throttling-in-kubernetes-c5b20bd8a718
https://blog.turbonomic.com/kubernetes-cpu-throttling-the-silent-killer-of-response-time-and-what-to-do-about-it
https://erickhun.com/posts/kubernetes-faster-services-no-cpu-limits/
https://engineering.indeedblog.com/blog/2019/12/unthrottled-fixing-cpu-limits-in-the-cloud/
https://www.youtube.com/watch?v=UE7QX98-kO0
You want to really understand decorators? Watch this video!
boilerplate:
import functools
def decorator(func):
@functools.wraps(func)
def wrapper_decorator(*args, **kwargs):
# Do something before
value = func(*args, **kwargs)
# Do something after
return value
return wrapper_decorator
Si j'avais le temps, ca me plairait bien !
When you want to publish a beta version, you can use a special tag that won't be proposed to client using pip install package --upgrade
example :
current version = 3.0.1
next version = 3.1.0
I can tag with 3.1.0-alpha.1
pip install --upgrade won't upgrade to this version but pip install package==3.1.0-alpha.1 will
def bubbleSort(arr):
n = len(arr)
# Traverse through all array elements
for i in range(n):
# Last i elements are already in place
for j in range(0, n-i-1):
# traverse the array from 0 to n-i-1
# Swap if the element found is greater
# than the next element
if arr[j] > arr[j+1] :
arr[j], arr[j+1] = arr[j+1], arr[j
bindkey -M emacs |grep edit-command
"^X^E" edit-command-line
ctrl x ctrl e pour editer la commande actuelle via vim