This article will describe the how the Apache Kafka work with components <<<<<<< HEAD Kafka and components： // to do ======= Kafka and components： // to do >>>>>>> 646945f00f4cd297d985fa39f786110cab66301d Source connector： // to do Sink connector： // to do Streamer： // to do Transformer // to do Register Schema // to do

How to config The config is very sample just show as below. Prerequisites One of the python server need to be installed, for example I chosed the pyright 1 $ pip install pyright Emacs Elisp 1 2 3 4 5 (use-package eglot :config (add-to-list 'eglot-server-programs '(python-mode . ("pyright-langserver" "--stdio"))) (add-hook 'python-mode-hook 'eglot-ensure))

Leetcode Questions about String 14.longest-common-prefix.java 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 class Solution { public String longestCommonPrefix(String[] strs) { // flower,flow,fly if (strs.length == 0) { return null; } String prefix = strs[0]; int lengths = strs.length; for (int i = 1; i < lengths; i++) { while (strs[i].indexOf(prefix) != 0) { prefix = prefix.substring(0, prefix.length()-1); } } return prefix; } } 125.

Bubble Sort Bubble Sort is a simple sorting algorithm. It compares two adjacent elements and swap them until all elements are in order. It’s not suitable for large data set as its time complexity are of (n2). 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 public class BubbleSort { public static void sort(Comparable[] a){ for(int i = a.

Quick Sort Quick sort is a Divide and Conquer algorithm. It partitions a large array into two arrays by a pivot value, and carry out the process recursively so that the entire array becomes an ordered sequence. 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 public class QuickSort { public static void main(String[] args) { System.