kylemart

diff --git a/parquet-hadoop/pom.xml b/parquet-hadoop/pom.xml
index 5e61b3103..fc2187a58 100644
--- a/parquet-hadoop/pom.xml
+++ b/parquet-hadoop/pom.xml
@@ -83,7 +83,7 @@
     <dependency>
       <groupId>org.xerial.snappy</groupId>
       <artifactId>snappy-java</artifactId>
-      <version>1.1.8</version>
+      <version>1.1.8.4</version>

kylemart

import cv2
import os
import re

INPUT_PATH = '/Users/kylemart/desktop/input'
OUTPUT_PATH = '/Users/kylemart/desktop/output/{clothing}/{filename}'
DESIRED_SIZE = 224
DESIRED_DIMENSIONS = (DESIRED_SIZE, DESIRED_SIZE)

kylemart

# -*- coding: utf-8 -*-
#
# Author: Kyle Martinez
# Date: November 18th, 2018
# About: Solution for solving
#        https://drive.google.com/file/d/1TAkZFkKmUQ78-BFqhuKXfeiZ2vTgxpfs/view
#        and for finding all of the patterns grouped by design.
#

from itertools import combinations

kylemart

~/Google Drive/Temp Shares/Install macOS Mojave.app
❯ tree
.
└── Contents
    ├── Frameworks
    │   └── OSInstallerSetup.framework
    │       ├── OSInstallerSetup -> Versions/Current/OSInstallerSetup
    │       ├── Resources -> Versions/Current/Resources
    │       └── Versions
    │           ├── A

kylemart

// Azure Storage JavaScript Client Library 2.9.100-preview
// Copyright (c) Microsoft and contributors. All rights reserved.
/* eslint-disable */
(function(f){if(typeof exports==="object"&&typeof module!=="undefined"){module.exports=f()}else if(typeof define==="function"&&define.amd){define([],f)}else{var g;if(typeof window!=="undefined"){g=window}else if(typeof global!=="undefined"){g=global}else if(typeof self!=="undefined"){g=self}else{g=this}(g.AzureStorage || (g.AzureStorage = {})).Blob = f()}})(function(){var define,module,exports;return (function(){function r(e,n,t){function o(i,f){if(!n[i]){if(!e[i]){var c="function"==typeof require&&require;if(!f&&c)return c(i,!0);if(u)return u(i,!0);var a=new Error("Cannot find module '"+i+"'");throw a.code="MODULE_NOT_FOUND",a}var p=n[i]={exports:{}};e[i][0].call(p.exports,function(r){var n=e[i][1][r];return o(n||r)},p,p.exports,r,e,n,t)}return n[i].exports}for(var u="function"==typeof require&&require,i=0;i<t.length;i++)o(t[i]);return o}return r})()({1:[function(r

kylemart

import java.util.*;
import java.lang.*;
import java.io.*;

/**
 * An iterative, DP-based solution for solving the N-wines problem.
 * 
 * <p>
 *     To use the program each wine value should be entered from the command line as a space-seperated integer.
 *     For example, <code>java MaxProfitSolution 1 2 3</code> will yield an expected output of 14 because

kylemart

import java.util.*;
import java.lang.*;
import java.io.*;

class Boldener
{
	private static final String OPEN_TAG = "<b>";
	private static final String CLOSE_TAG = "</b>";
	
	private final String[] sequencesToBolden;