SYMBOL INDEX (228 symbols across 44 files)

FILE: code/algorithm_applications/src/Cichelli's Perfect Hashing Alogorithm/Hashing.java
  class Hashing (line 8) | public class Hashing {
    method main (line 10) | public static void main(String[] args) {
    method openTextFile (line 92) | public static Scanner openTextFile(String fileName)	{
    method readKeys (line 107) | public static void readKeys(Scanner data, ArrayList<Key> listOfKeys)	{
    method populateOccurencesOfLetters (line 118) | public static void populateOccurencesOfLetters(ArrayList<Key> listOfKe...
    method setValueOfAllKeys (line 139) | public static void setValueOfAllKeys(ArrayList<Key> listOfKeys, int[] ...
    method populateUniqueLetters (line 152) | public static void populateUniqueLetters(ArrayList<Character> uniqueLe...
    method populateGArray (line 161) | public static void populateGArray(ArrayList<Character >uniqueLetters, ...
    method populateStack (line 173) | public static void populateStack(ArrayList<Key> listOfKeys, Stack<Key>...
    method cichelli (line 180) | public static boolean cichelli(Stack<Key> keyWordStack, Key [] hashTab...
    method hashFunction (line 323) | public static int hashFunction(Key keyWord, int gFirst, int gLast, int...
    method hashFunction (line 329) | public static int hashFunction(String word, int gFirst, int gLast, int...
    method initializeCounter (line 335) | public static void initializeCounter(int[] keyWordCounter)	{
    method readOtherFile (line 341) | public static void readOtherFile(Scanner data, int g[][], Key[] hashTa...
    method checkForKeyWord (line 373) | public static void checkForKeyWord(String[] words, int[][] g, Key[] ha...
    method printResults (line 400) | public static void printResults(int lineCounter, int wordCounter, Key[...

FILE: code/algorithm_applications/src/Cichelli's Perfect Hashing Alogorithm/Key.java
  class Key (line 1) | public class Key implements Comparable<Key> {
    method Key (line 9) | public Key(String keyWord)	{
    method compareTo (line 26) | @Override
    method getKeyWord (line 34) | public String getKeyWord()	{
    method getFirstLetter (line 38) | public char getFirstLetter()	{
    method getLastLetter (line 42) | public char getLastLetter()	{
    method getFirstLetterValue (line 46) | public int getFirstLetterValue()	{
    method setFirstLetterValue (line 50) | public void setFirstLetterValue(int value)	{
    method getLastLetterValue (line 54) | public int getLastLetterValue()	{
    method setLastLetterValue (line 58) | public void setLastLetterValue(int value)	{
    method setTotalValue (line 62) | public void setTotalValue(int value)	{
    method getTotalValue (line 66) | public int getTotalValue()	{
    method setPositionInGFirst (line 70) | public void setPositionInGFirst(int position)	{
    method getPositionInGFirst (line 74) | public int getPositionInGFirst()	{
    method setpositionInGLast (line 79) | public void setpositionInGLast(int position)	{
    method getPositionInGLast (line 83) | public int getPositionInGLast()	{
    method setUnassignedLetterPosition (line 87) | public void setUnassignedLetterPosition(int position)	{
    method getUnassignedLetterPosition (line 91) | public int getUnassignedLetterPosition()	{

FILE: code/algorithm_applications/src/Strassens algorithm/strassens algorithm.cpp
  function comp (line 7) | static bool comp(vector<int> &v1, vector<int> &v2)
  function aloc_ary (line 12) | vector<vector<int>> aloc_ary(vector<vector<int>> a, int l, int m, int n)
  function adn_ary (line 23) | vector<vector<int>> adn_ary(vector<vector<int>> a, vector<vector<int>> b...
  function sbn_ary (line 33) | vector<vector<int>> sbn_ary(vector<vector<int>> a, vector<vector<int>> b...
  function crt (line 43) | void crt(vector<int> g[], int n, int st)
  function cbn_ary (line 66) | void cbn_ary(vector<vector<int>> &c, vector<vector<int>> c11, int i, int...
  function mul_ary (line 74) | vector<vector<int>> mul_ary(vector<vector<int>> ary1, vector<vector<int>...
  function main (line 112) | int main()

FILE: code/algorithm_applications/src/binary_search/ceil_of_element/ceil_of_element_in_sorted_array.cpp
  function solve (line 3) | int solve(int arr[],int n, int ele){
  function main (line 22) | int main(){

FILE: code/algorithm_applications/src/binary_search/distributing_candies/CandyDistribution.java
  class CandyDistribution (line 5) | class CandyDistribution {
    method main (line 6) | public static void main(String[] args) throws IOException {
    method binarySearch (line 27) | public static long binarySearch(int n, long k, long[] arr, long max){
    method canDistribute (line 46) | public static boolean canDistribute(long val, int n, long k, long[] arr){

FILE: code/algorithm_applications/src/binary_search/first_and_last_position_in_sorted_array/firstAndLastPosInSortedArray.cpp
  function first (line 4) | int first(int arr[], int x, int n)
  function last (line 24) | int last(int arr[], int x, int n)
  function main (line 44) | int main()

FILE: code/algorithm_applications/src/binary_search/floor_of_element/floor_of_element_in_sorted_array.cpp
  function solve (line 3) | int solve(int arr[],int n,int ele){
  function main (line 22) | int main(){

FILE: code/algorithm_applications/src/bubble_sort/bubble_sort_implementation.cpp
  function main (line 5) | int main() {

FILE: code/algorithm_applications/src/merge_arrays/merge_two_arrays.c
  function main (line 3) | int main(){

FILE: code/artificial_intelligence/src/a_star/a_star.py
  class Node (line 4) | class Node:
    method __init__ (line 7) | def __init__(self, parent=None, position=None):
    method __eq__ (line 15) | def __eq__(self, other):
  function make (line 19) | def make(n):
  function astar (line 30) | def astar(maze, start, end):
  function showPath (line 132) | def showPath(maze, path, n, start, end):
  function main (line 150) | def main():

FILE: code/artificial_intelligence/src/dbscan_clustering/dbscan.py
  function _dist (line 10) | def _dist(p, q):
  function _eps_neighborhood (line 14) | def _eps_neighborhood(p, q, eps):
  function _region_query (line 18) | def _region_query(m, point_id, eps):
  function _expand_cluster (line 27) | def _expand_cluster(m, classifications, point_id, cluster_id, eps, min_p...
  function dbscan (line 54) | def dbscan(m, eps, min_points):
  function main (line 91) | def main():

FILE: code/artificial_intelligence/src/decision_tree/decision_tree.py
  function load_csv (line 11) | def load_csv(filename):
  function str_column_to_float (line 19) | def str_column_to_float(dataset, column):
  function cross_validation_split (line 25) | def cross_validation_split(dataset, n_folds):
  function accuracy_metric (line 39) | def accuracy_metric(actual, predicted):
  function evaluate_algorithm (line 48) | def evaluate_algorithm(dataset, algorithm, n_folds, *args):
  function test_split (line 70) | def test_split(index, value, dataset):
  function gini_index (line 81) | def gini_index(groups, classes):
  function get_split (line 102) | def get_split(dataset):
  function to_terminal (line 115) | def to_terminal(group):
  function split (line 121) | def split(node, max_depth, min_size, depth):
  function build_tree (line 147) | def build_tree(train, max_depth, min_size):
  function predict (line 154) | def predict(node, row):
  function decision_tree (line 168) | def decision_tree(train, test, max_depth, min_size):

FILE: code/artificial_intelligence/src/decision_tree/decision_trees_information_gain.py
  class Node (line 6) | class Node:
    method __init__ (line 7) | def __init__(self):
  class decision_tree (line 16) | class decision_tree:
    method __init__ (line 17) | def __init__(self):
    method train (line 23) | def train(self, x_train, y_train):
    method build (line 26) | def build(self, current_node, x_train, y_train, entropy_parent, cur_de...
    method predict (line 133) | def predict(self, test):
    method test_fun (line 139) | def test_fun(self, cur_node, test):

FILE: code/artificial_intelligence/src/factorization_machines/matrix_factorization.py
  function matrix_factorization (line 4) | def matrix_factorization(data, K, steps=5000, beta=0.0002, lamda=0.02):
  function readFile (line 74) | def readFile(fileString):

FILE: code/artificial_intelligence/src/gaussian_naive_bayes/gaussian_naive_bayes_moons.py
  function make_moons (line 16) | def make_moons(n_samples=100, shuffle=True, noise=None, random_state=None):

FILE: code/artificial_intelligence/src/hierachical_clustering/hierachical_clustering.cpp
  class TreeNode (line 15) | class TreeNode {
    method TreeNode (line 27) | TreeNode()
    method setLocation (line 41) | void setLocation(int i, double j)
    method TreeNode (line 47) | TreeNode* getNext()
    method getLocation (line 52) | double getLocation(int i)
    method setNext (line 57) | void setNext( TreeNode *input)
    method setLegit (line 62) | void setLegit()
    method Legitimacy (line 67) | bool Legitimacy()
  type Subtree (line 75) | struct Subtree
  class HierachicalTree (line 81) | class HierachicalTree {
    method HierachicalTree (line 95) | HierachicalTree()
    method addToList (line 102) | void addToList(TreeNode *Item)
    method organise (line 116) | void organise()
    method buildTree (line 133) | void buildTree()
    method Subtree (line 138) | Subtree *subtreeAt(int level)
    method rightEnd (line 144) | int rightEnd(TreeNode *p)
    method leftEnd (line 152) | int leftEnd(TreeNode *p)
  function Subtree (line 269) | Subtree *HierachicalTree::atLevel(int lvl, TreeNode *parent)
  function main (line 282) | int main(void)

FILE: code/artificial_intelligence/src/image_processing/canny/canny.cpp
  function Mat (line 57) | Mat canny::toGrayScale()

FILE: code/artificial_intelligence/src/image_processing/canny/canny.h
  function class (line 14) | class canny {

FILE: code/artificial_intelligence/src/image_processing/canny/main.cpp
  function main (line 16) | int main()

FILE: code/artificial_intelligence/src/image_processing/erode_dilate/main.cpp
  function main (line 22) | int main( int argc, char** argv )
  function Erosion (line 61) | void Erosion( int, void* )
  function Dilation (line 81) | void Dilation( int, void* )

FILE: code/artificial_intelligence/src/image_processing/houghtransform/main.cpp
  function create_gui (line 24) | void create_gui()
  function destroy_gui (line 42) | void destroy_gui()
  function disp_msg (line 53) | void disp_msg(const char *msg)
  function main (line 68) | int main(int argc, char **argv)

FILE: code/artificial_intelligence/src/image_processing/image_stitching/imagestitching.cpp
  function main (line 19) | int main(int argc, char* argv[])

FILE: code/artificial_intelligence/src/image_processing/prewittfilter/prewitt.cpp
  function xGradient (line 11) | int xGradient(cv::Mat image, int x, int y)
  function yGradient (line 25) | int yGradient(cv::Mat image, int x, int y)
  function main (line 35) | int main()

FILE: code/artificial_intelligence/src/image_processing/sobelfilter/sobel.cpp
  function xGradient (line 10) | int xGradient(cv::Mat image, int x, int y)
  function yGradient (line 24) | int yGradient(cv::Mat image, int x, int y)
  function main (line 34) | int main()

FILE: code/artificial_intelligence/src/isodata_clustering/isodata.py
  function distance_2point (line 5) | def distance_2point(x1, y1, x2, y2):
  function volume_estimation (line 10) | def volume_estimation(cluster, center):
  function new_cluster_centers (line 22) | def new_cluster_centers(cluster):
  function center_distance (line 29) | def center_distance(centers):
  function standart_deviation (line 46) | def standart_deviation(values, center):
  function cluster_points_distribution (line 60) | def cluster_points_distribution(centers, points):
  function cluster_division (line 89) | def cluster_division(cluster, center, dev_vector):
  function cluster_union (line 111) | def cluster_union(cluster1, cluster2, center1, center2):
  function clusterize (line 127) | def clusterize():

FILE: code/artificial_intelligence/src/k_means/k-means.c
  function main (line 4) | int main()

FILE: code/artificial_intelligence/src/k_means/k_means.cpp
  type point (line 23) | struct point
  function kmeans (line 37) | double kmeans(ByteImage& bimg, const int K, double weight)

FILE: code/artificial_intelligence/src/k_nearest_neighbours/KNN.c
  type point (line 41) | struct point {
  function main (line 47) | int main(){

FILE: code/artificial_intelligence/src/k_nearest_neighbours/k_nearest_neighbours.cpp
  type Point (line 7) | struct Point {
  function main (line 14) | int main() {
  function euclideanDistance (line 98) | float euclideanDistance(Point p, Point v) {

FILE: code/artificial_intelligence/src/k_nearest_neighbours/k_nearest_neighbours.py
  function loadDataset (line 9) | def loadDataset(filename, split, trainingSet=[], testSet=[]):
  function euclideanDistance (line 22) | def euclideanDistance(instance1, instance2, length):
  function getNeighbors (line 29) | def getNeighbors(trainingSet, testInstance, k):
  function getResponse (line 42) | def getResponse(neighbors):
  function getAccuracy (line 54) | def getAccuracy(testSet, predictions):
  function main (line 62) | def main():

FILE: code/artificial_intelligence/src/linear_regression/linear_regression.java
  class LinearRegression (line 3) | public class LinearRegression {
    method main (line 5) | public static void main(String[] args) {

FILE: code/artificial_intelligence/src/linear_regression/linear_regression.py
  function estimate_coef (line 7) | def estimate_coef(x, y):
  function plot_regression_line (line 25) | def plot_regression_line(x, y, b):
  function main (line 43) | def main():

FILE: code/artificial_intelligence/src/logistic_regression/logistic_regression.py
  function sigmoid (line 7) | def sigmoid(scores):
  function log_likelihood (line 11) | def log_likelihood(features, target, weights):
  function logistic_regression (line 17) | def logistic_regression(

FILE: code/artificial_intelligence/src/minimax/minimax.py
  class IllegalMoveException (line 5) | class IllegalMoveException(Exception):
  function new_copy (line 9) | def new_copy(in_list):
  class GameState (line 16) | class GameState(object):
    method __init__ (line 17) | def __init__(self, board, turn, move_count=0):
    method switch_turn (line 30) | def switch_turn(self):
    method move (line 33) | def move(self, x, y):
    method __str__ (line 51) | def __str__(self):
    method check_winner (line 71) | def check_winner(self):
    method next_states_and_moves (line 117) | def next_states_and_moves(self):
    method evaluate (line 134) | def evaluate(self, symbol):
  class GameDriver (line 207) | class GameDriver(object):
    method __init__ (line 208) | def __init__(self):
    method player_move (line 258) | def player_move(self):
    method computer_move (line 281) | def computer_move(self):
    method minimax (line 300) | def minimax(self, board, level, comp_turn, alpha, beta):
    method start (line 334) | def start(self):

FILE: code/artificial_intelligence/src/missionaries_and_cannibals.py
  function get_boat_at_left_new_states (line 10) | def get_boat_at_left_new_states(game_state):                            ...
  function get_boat_at_right_new_states (line 26) | def get_boat_at_right_new_states(game_state):                           ...
  function get_future_states (line 42) | def get_future_states(game_state):                                      ...
  function bfs (line 48) | def bfs():

FILE: code/artificial_intelligence/src/naive_bayes/naive_bayes.cpp
  function count (line 10) | unordered_map<string, int> count(pair<vector<string>, vector<string>> &f...
  function calcProb (line 80) | unordered_map<string, double> calcProb(unordered_map<string, int> &d, pa...
  function finalPredictions (line 100) | vector<string> finalPredictions(unordered_map<string, double> &x, pair<v...
  function main (line 140) | int main()

FILE: code/artificial_intelligence/src/naive_bayes/naive_bayes.py
  function count_words (line 5) | def count_words(features, output):
  function calculate_probabilities (line 36) | def calculate_probabilities(d, features, output):
  function final_prediction (line 50) | def final_prediction(x, features, output_set):

FILE: code/artificial_intelligence/src/neural_network/neural_network.py
  class neural_network (line 8) | class neural_network:
    method __init__ (line 9) | def __init__(self, num_layers, num_nodes, activation_function, cost_fu...
    method train (line 23) | def train(self, batch_size, inputs, labels, num_epochs, learning_rate,...
    method forward_pass (line 39) | def forward_pass(self, inputs):
    method relu (line 61) | def relu(self, layer):
    method softmax (line 66) | def softmax(self, layer):
    method sigmoid (line 71) | def sigmoid(self, layer):
    method tanh (line 75) | def tanh(self, layer):
    method calculate_error (line 79) | def calculate_error(self, labels):
    method back_pass (line 113) | def back_pass(self, labels):
    method predict (line 144) | def predict(self, filename, input):
    method check_accuracy (line 154) | def check_accuracy(self, filename, inputs, labels):
    method load_model (line 171) | def load_model(self, filename):
  class layer (line 175) | class layer:
    method __init__ (line 176) | def __init__(
    method add_bias (line 190) | def add_bias(self, batch_size, num_nodes_in_next_layer):

FILE: code/artificial_intelligence/src/number_recogniser/python/nn.py
  class neural_network (line 4) | class neural_network:
    method __init__ (line 5) | def __init__(self, layer_sizes):
    method predict (line 12) | def predict(self, a):
    method accuracy (line 17) | def accuracy(self, images, labels):
    method activation (line 30) | def activation(x):

FILE: code/artificial_intelligence/src/particle_swarm_optimization/gbestPSO/Gbest2D.py
  function f (line 5) | def f(x):

FILE: code/artificial_intelligence/src/particle_swarm_optimization/gbestPSO/Gbest3D.py
  function f (line 6) | def f(args):

FILE: code/artificial_intelligence/src/particle_swarm_optimization/lbestPSO/LBest3D.py
  function f (line 6) | def f(args):
  function distance (line 10) | def distance(p1, p2):

FILE: code/artificial_intelligence/src/perceptron/perceptron.py
  function predict (line 2) | def predict(row, weights):
  function train_weights (line 12) | def train_weights(train, l_rate, n_epoch):

FILE: code/artificial_intelligence/src/q_learning/q_learning.js
  constant TERMINAL (line 4) | const TERMINAL = "terminal";
  constant TOTAL_EPISODE (line 5) | const TOTAL_EPISODE = 10;
  function State (line 7) | function State(stateName, actions) {
  class QLearning (line 16) | class QLearning {
    method constructor (line 17) | constructor(
    method addState (line 32) | addState(name, actions) {
    method bestAction (line 39) | static bestAction(stateActions) {
    method checkStateExist (line 63) | checkStateExist(stateName) {
    method chooseAction (line 67) | async chooseAction(stateName) {
    method learn (line 88) | learn(stateName, actionName, reward, nextStateName) {
  class RoadEnv (line 108) | class RoadEnv {
    method constructor (line 109) | constructor() {
    method render (line 114) | static render(stateName) {
    method step (line 123) | static step(stateName, action) {
    method normalTransition (line 146) | static normalTransition(stateName) {