Girish Budhwani girish3

## Easing functions
var easing = {
		linear : function (t){
			return t;
		},
		easeInQuad: function (t) {
			return t*t;
		},
		easeOutQuad: function (t) {
			return -1 *t*(t-2);
		},

## doubly_linked_list.js
var Node = function ( data ) {

  this.data = data;
  this.next = null;
  this.previous = null;
}

var LinkedList = function () {

  this.first = null;

## migrating to mongolab
# your backup folder
cd /backup

# make sure mongod instance is running
mongodump --db dbname --out ./

# above line will create a folder dbname
cd dbname

# migrate to mongolab

## ResizeAnimation.java
public class ResizeAnimation extends Animation {
	final int startWidth;
	final int targetWidth;
	View view;

	public ResizeAnimation(View view, int targetWidth) {
		this.view = view;
		this.targetWidth = targetWidth;
		startWidth = view.getWidth();
	}

## RecyclerViewTemplate.md

      
              1 file
            
          
              0 forks
            
          
              0 comments
            
          
              0 stars
            
          
                girish3
                / RecyclerViewTemplate.md
            
            
              Last active
              May 24, 2020 11:05
            
              
                [[Deprecated] Recycler view] Its too much work when I need a simple list to experiment some stuff in Android. This file to my rescue. #android_snippet #android
              
          
    Adapter

// Adapter code
public class CustomAdapter extends RecyclerView.Adapter<RecyclerView.ViewHolder> {

    ArrayList<String> mItems;

    public CustomAdapter(Context context, ArrayList<String> items) {

  
## .gitignore
# Built application files
*.apk
*.ap_
*.aab

# Files for the ART/Dalvik VM
*.dex

# Java class files
*.class

## avl_tree.py
#import random, math

outputdebug = False

def debug(msg):
    if outputdebug:
        print msg

class Node():
    def __init__(self, key):

## doubleList.py
class DoubleList(object):

    head = None
    tail = None
    size = 0

    def append(self, data):
        new_node = Node(data)
        if self.head is None:
            self.head = self.tail = new_node

## doubleList.py
class DoubleList(object):

    head = None
    tail = None
    size = 0

    def append(self, data):
        new_node = Node(data)
        if self.head is None:
            self.head = self.tail = new_node

## string_matching_naive.py
# Here is the working code of the naive approach.
def bruteSearch(W, T):
    # edge case check
    if W == "":
            return -1

    # getting the length of the strings
    wordLen = len(W)
    textLen = len(T)
	var easing = {
	linear : function (t){
	return t;
	},
	easeInQuad: function (t) {
	return t*t;
	},
	easeOutQuad: function (t) {
	return -1 t(t-2);
	},
	var Node = function ( data ) {

	this.data = data;
	this.next = null;
	this.previous = null;
	}

	var LinkedList = function () {

	this.first = null;
	# your backup folder
	cd /backup

	# make sure mongod instance is running
	mongodump --db dbname --out ./

	# above line will create a folder dbname
	cd dbname

	# migrate to mongolab
	public class ResizeAnimation extends Animation {
	final int startWidth;
	final int targetWidth;
	View view;

	public ResizeAnimation(View view, int targetWidth) {
	this.view = view;
	this.targetWidth = targetWidth;
	startWidth = view.getWidth();
	}
	# Built application files
	*.apk
	*.ap_
	*.aab

	# Files for the ART/Dalvik VM
	*.dex

	# Java class files
	*.class
	#import random, math

	outputdebug = False

	def debug(msg):
	if outputdebug:
	print msg

	class Node():
	def __init__(self, key):
	class DoubleList(object):

	head = None
	tail = None
	size = 0

	def append(self, data):
	new_node = Node(data)
	if self.head is None:
	self.head = self.tail = new_node
	# Here is the working code of the naive approach.
	def bruteSearch(W, T):
	# edge case check
	if W == "":
	return -1

	# getting the length of the strings
	wordLen = len(W)
	textLen = len(T)