KLog | The main functions

are c libraries built automatically? My assumption is that those are not.

Why? Tests from the offical repo shows, that it is done automatically

is it possible to use cc_library rule to build shared library that can be used in cgo? if so, how to connect those?

See example from here

I don't see anything particularly wrong with the command you are running. However, t2.micro are very small, and may be too small for the cluster to function.

You can have a look at the kops-operator logs why it is not starting. Try kubectl logs kops-controller-xxxx and kubectl describe pod kops-controller-xxx

One of my iop (from kubectl get iop -A) have "policy" or "telemetry" fields which are no longer supported . So I need to delete them.

1. kubectl delete iop [iopname] -n istio-system

This get stucked though because my controller is already gone. So I have to do

1. kubectl edit iop [iopname] -n istio-system
2. Remove istiooperators.install.istio.io from the finalizer
3. Apply

After this I can see no error logs when I tried to install istio-CNI again followed by istioctl operator init.

First of all, thanks to @ShudiptaSharma. His comment helped me in figuring out that I was trying to get the cluster config from outside of the cluster which was leading the program on my local machine (127.0.0.1) from where I am not able to access the cluster.

Further, I tried to figure out how to access the cluster from outside the cluster and found that InClusterConfig is used for running inside cluster use case, when running outside the cluster, something like the following can be used:

I did some calculations and at no point, I see that NLogK better than KlogN.

Since, K <= N, NlogK will always be more than or equal to KlogN.

That does not mean, min heap approach is going to take more time than max heap approch.

Need to consider the below,

1. In Min heap approach, we will update the heap only if the next value is larger than the head. If the array is in ascending order, we will do it (N-K) times, if it is descending order we will not update it at all. On average, the number of times the tree gets updated is considerable less than N.

2. In Max heap, you need to heapify the tree of size N. If K is negligibly small when compared to N, then this time can become a dominant factor. While in the case of min heap, heapify works on the smaller set of K. Also as mentioned in point 1, most of the value of N will not trigger an update of the tree.

I wrote a small program to compare both the approach. The source can be accessed here.

Results for an array ranging from 0 to 1M in random order is below:

This line

This is std::nth_element

From cppreference:

Notes The algorithm used is typically introselect although other selection algorithms with suitable average-case complexity are allowed.

Given a list of numbers

although it is not compatible with std::list, only std::vector, std::deque and std::array, as it requires RandomAccessIterator.

It's indirect in this module file, so probably not needed (not imported by your code). That's why it's unnecessary to vendor.

It's tracked because it's a dependency of your machinery dependency but actually packages you're using from machinery don't need packages from code-generator.

If you want to vendor it explicitly, you can do a blank import somewhere in your code such that

Why I set page size = 10 but I got the paged list size = 13?

You set the page size 10 but all items are showing. That might have you crash in device. But, not in all devices.