kowshikRoy

Grouping of Python Scripts by Functionality

This document categorizes the Python scripts in this project into functional groups, providing a clear overview of the data processing and analysis workflow.

---

1. Data Pre-processing

These scripts are responsible for cleaning, merging, and structuring the raw data into a format suitable for analysis.

kowshikRoy

# Copyright 2017 Istio Authors
#
#   Licensed under the Apache License, Version 2.0 (the "License");
#   you may not use this file except in compliance with the License.
#   You may obtain a copy of the License at
#
#       http://www.apache.org/licenses/LICENSE-2.0
#
#   Unless required by applicable law or agreed to in writing, software
#   distributed under the License is distributed on an "AS IS" BASIS,

kowshikRoy

apiVersion: v1
kind: Namespace
metadata:
  name: istio-system
  labels:
    istio-injection: disabled
---
# Source: istio/charts/galley/templates/configmap.yaml
apiVersion: v1
kind: ConfigMap

kowshikRoy

# Copyright 2017 Istio Authors
#
#   Licensed under the Apache License, Version 2.0 (the "License");
#   you may not use this file except in compliance with the License.
#   You may obtain a copy of the License at
#
#       http://www.apache.org/licenses/LICENSE-2.0
#
#   Unless required by applicable law or agreed to in writing, software
#   distributed under the License is distributed on an "AS IS" BASIS,

kowshikRoy

Vagrant.configure("2") do |config|
  config.vm.define "vm1" do |vm1|
    vm1.vm.box = "ubuntu/xenial64"
  end
  config.vm.define "vm2" do |vm2|
    vm2.vm.box = "ubuntu/xenial64"
  end
end

kowshikRoy

const long long is_query = -(1LL<<62);
struct Line {
    long long m, b;
    mutable function<const Line*()> succ;
    bool operator<(const Line& rhs) const {
        if (rhs.b != is_query) return m < rhs.m;
        const Line* s = succ();
        if (!s) return 0;
        long long x = rhs.m;

kowshikRoy

#include<bits/stdc++.h>
using namespace std;

const int MAXN = 100005; // Length of the String
typedef int T;          //
struct Node{
    int nxt[26]; //In case alphabet is fixed,Change Accordingly
    int len, link;
    T val;
};

kowshikRoy

/*Suffix Automaton
    * A DAG in String Stores all Substring information
    * Complexity : O(n)

    * len[v] -> Maximum length of the string accepted by state v
    * link[v] -> Denotes a state which is a proper suffix of v and in different endpos class
    * SIGMA -> # of different character
    * # of substring accepted by a state = len[v] - len[link[v]]
    * # of different substring = # of different paths in the DAG from root
    * # of occurrence of a string which ends at p = # of paths from p to terminal nodes

kowshikRoy

/*

 *************************
 Id  : Matrix.code
 Task:
 Date:

 **************************

 */

kowshikRoy

const int N = 100000;
int pf[N];
void comp(char P[],int Psize)
{
	pf[0] = 0;
	for(int i = 1; i < Psize ; i ++ ) {
		int  j = pf[i-1];
		while( j > 0 && P[i] != P[j]) j = pf[j-1];
		if(P[i] == P[j]) ++ j ;