[ POPULAR STORIES ]

CATCH UP THE POPULAR STORIES

Elasticsearch Geo-Shape Slow Indexing Performance – Solved

           We were using Hosted Elasticsearch 1.4.4 to index geo-shape data with the following field mapping. { "geoShapeField": {     "type": "geo_shape",        "tree": "quadtree",        "tree_levels": 26 //Or use precision: "1m",        "distance_error_pct": 0.025 // Optional, 0.025 is default } }      … Read More »

Read more
Alternative text

ElasticTab – Elasticsearch to Excel Report

GitHub Page : ElasticTab – Elasticsearch to Excel Report ( https://github.com/raghavendar-ts/ElasticTab-Elasticsearch-to-Excel-Report ) 1. Introduction There are a lot of companies(small scale to large scale companies) who use Elasticsearch to store massive amount of to data.Most of them find it hard to generate simple reports from Elasticsearch to get information out of it. So this Java application can be… Read More »

Read more
Alternative text

Java – Replace First Occurrence of String without Regular Expression

           The String class in Java has a method replaceFirst(String regex, String replacement) which replaces first occurrence of given regular expression with given replacement string. If you want to replace first occurrence of any given string (with Regular Expression), use the following code. Sample Code: package test; import java.util.regex.Pattern; public class test{… Read More »

Read more
Alternative text

Linked List in C – Split a Linked List into 2 Linked List

DATA STRUCTURES IN C – LINKED LIST (20 PROGRAMS) Try DATA STRUCTURES IN C – LINKED LIST (20 PROGRAMS) Linked List in C- Split a Linked List into 2 Linked List : Input:         Head Pointer: head1         Original linked list: node 1->node 2->node 3->node 4->node 5->node 6->node 7 Output:    … Read More »

Read more
Alternative text

Linked List in C – Insertion Sort

DATA STRUCTURES IN C – LINKED LIST (20 PROGRAMS) Try DATA STRUCTURES IN C – LINKED LIST (20 PROGRAMS) Linked List in C – Insertion Sort : Source Code : #include<stdio.h> struct node { int data; struct node *next; }; struct node *head=NULL; void insert_sort(int data) { struct node *temp=head; struct node *prev=NULL; struct node *ptr;… Read More »

Read more
Alternative text

[ LATEST STORIES ]

CATCH UP THE LATEST STORIES

[ SUBSCRIBE TO OUR BLOG ]