yungwarlock

import 'package:flutter/material.dart';
import "package:flutter/scheduler.dart";

const Color darkBlue = Color.fromARGB(255, 18, 32, 47);

void main() {
  runApp(MyApp());
}

class MyApp extends StatelessWidget {

yungwarlock

            /* item.subtitle != null */
            /*     ? Container( */
            /*         padding: const EdgeInsets.symmetric( */
            /*           vertical: 4, */
            /*           horizontal: 8, */
            /*         ), */
            /*         color: Colors.grey[100], */
            /*         child: Row( */
            /*           children: [ */
            /*             CircleAvatar( */

yungwarlock

// async function uploadCourseThumbnail(path: string) {
//   const fileID = createID();
//   const file = storage.file(`${fileID}.png`);

//   file.makePublic();

//   return new Promise((resolve, reject) => {
//     const publicUrl = file.publicUrl();

yungwarlock

async function uploadCourseThumbnail(path: string) {
  const fileID = createID();
  const file = storage.file(`${fileID}.png`);

  file.makePublic();

  return new Promise((resolve, reject) => {
    const publicUrl = file.publicUrl();

    fs.createReadStream(path)

yungwarlock

yungwarlock

import 'dart:async';

void main() {
  int countDown = 60;
  bool shouldShowResend = false;
  Timer.periodic(const Duration(seconds: 1), (t) {
    print(formatTime(countDown));
    print(shouldShowResend);
  });
  

yungwarlock

#!/usr/bin/env bash

# Initialize all the option variables.
# This ensures we are not contaminated by variables from the environment.
file=
verbose=0

show_help() {
  echo "Hello"
}

yungwarlock

You can learn more about it in this issue

bazelbuild/rules_python#330

The fix that worked for me was using the comment

bazelbuild/rules_python#330 (comment)

Prevent creation of empty init.py

yungwarlock

def insertionsort(A):
    #we start loop at second element (index 1) since the first item is already sorted
    for j in range(1,len(A)):
        key = A[j] #The next item we are going to insert into the sorted section of the array

        i = j-1 #the last item we are going to compare to
        #now we keep moving the key back as long as it is smaller than the last item in the array
        while (i >= 0) and key < A[i]: #if i == -1 means that this key belongs at the start
            A[i+1]=A[i] #move the last object compared one step ahead to make room for key
            i=i-1 #observe the next item for next time.

yungwarlock

import React from 'react';
import useFeatureFlag from './useFeatureFlag';
import RecommendationsComponent from './Recommendations.js';

const { 
  DecoratedComponent: Recommendations, 
  featureEnabled: recommendationsFeatureEnabled,
  FeatureFlag
} = useFeatureFlag({
  Component: RecommendationsComponent,