I hereby claim:
- I am jinankjain on github.
- I am jinankjain (https://keybase.io/jinankjain) on keybase.
- I have a public key whose fingerprint is EDFB 9EA4 599B D995 E846 94E4 4B22 F448 CA24 E57B
To claim this, I am signing this object:
require 'formula' | |
class Uthash < Formula | |
homepage 'https://github.com/troydhanson/uthash'; | |
head 'https://github.com/troydhanson/uthash.git'; | |
def install | |
include.install Dir['src/*'] | |
end | |
end |
package cmd | |
import ( | |
"fmt" | |
"k8s.io/client-go/pkg/api" | |
_ "k8s.io/client-go/pkg/api/install" | |
apiv1 "k8s.io/client-go/pkg/api/v1" | |
_ "k8s.io/client-go/pkg/apis/apps/install" | |
_ "k8s.io/client-go/pkg/apis/extensions/install" |
public class SmsReceiver extends BroadcastReceiver { | |
public void onReceive(Context c, Intent i) { | |
Bundle bundle = intent.getExtras(); | |
Object[] pdusObj = (Object[]) bundle.get(”pdus”); | |
StringBuilder sb = new StringBuilder(); | |
for (int i = 0; i < pdusObj.length; i++) { | |
SmsMessage msg = SmsMessage.createFromPdu((byte[]]) pdusObj[i]); // source | |
String body = msg.getDisplayMessageBody(); | |
sb.append(body); | |
} |
public LocationLeak2 extends Activity implements | |
LocationListener { | |
private double latitude; | |
protected void onResume() { | |
double d = this.latitude; | |
Log.d(”Latitude”, ”Latitude: ”+ d); // sink | |
} | |
public void onLocationChanged(Location loc) { | |
double lat = loc.getLatitude(); // loc is a source | |
this.latitude = lat; |
public class LeakageApp extends Activity { | |
EditText passwordText = | |
( EditText )findViewById(R.id.pwdString); | |
String pwd = passwordText . toString (); | |
} | |
// Callback method in xml file | |
public void sendMessage ( View view ) | |
Password pwd = user . getpwd (); | |
String pwdString = pwd . getPassword (); |
I hereby claim:
To claim this, I am signing this object:
#include <bits/stdc++.h> | |
using namespace std; | |
#define MAXN 1000 | |
#define MAXLOGN 10 | |
int M[MAXN][MAXLOGN]; | |
void createST(int A[], int N) | |
{ | |
for(int i=0;i<N;i++) |
#include <bits/stdc++.h> | |
using namespace std; | |
#define MAXN 100 | |
// M[i] is the index of minimum element from A[i*sqrtN] to A[i*sqrtN+sqrtN-1] | |
int M[MAXN]; | |
int size_m; // size of M array | |
void createRMQ(int A[], int N) | |
{ |