<?php 
if ( ! defined( 'ABSPATH' ) ) {
    exit; // Exit if accessed directly.
}

class Custom_Podcast_Widget extends \Elementor\Widget_Base {
    public function get_name() {
        return 'custom_audio_podcast';
    }

    public function get_title() {
        return __('Custom Audio Podcast', 'plugin-name');
    }

    public function get_icon() {
        return 'eicon-play';
    }

    public function get_categories() {
        return ['general'];
    }

    protected function register_controls() {
		$this->start_controls_section(
            'author_section',
            [
                'label' => __('Author Information', 'plugin-name'),
                'tab' => \Elementor\Controls_Manager::TAB_CONTENT,
            ]
        );

        $this->add_control(
            'author_name',
            [
                'label' => __('Author Name', 'plugin-name'),
                'type' => \Elementor\Controls_Manager::TEXT,
                'default' => __('Author Name', 'plugin-name'),
            ]
        );

        $this->add_control(
            'author_image',
            [
                'label' => __('Author Image', 'plugin-name'),
                'type' => \Elementor\Controls_Manager::MEDIA,
                'media_type' => 'image',
            ]
        );

        $this->end_controls_section();
		
		
// 		Content section
        $this->start_controls_section(
            'content_section',
            [
                'label' => __('Content', 'plugin-name'),
                'tab' => \Elementor\Controls_Manager::TAB_CONTENT,
            ]
        );

        $repeater = new \Elementor\Repeater();
		
		$repeater->add_control(
			'media_type',
			[
				'label' => __('Media Type', 'plugin-name'),
				'type' => \Elementor\Controls_Manager::SELECT,
				'options' => [
					'audio' => __('Audio', 'plugin-name'),
					'video' => __('Video', 'plugin-name'),
				],
				'default' => 'audio',
			]
		);


        $repeater->add_control(
			'file',
			[
				'label' => __('Media File', 'plugin-name'),
				'type' => \Elementor\Controls_Manager::MEDIA,
				'media_type' => ['audio', 'video'], 
			]
		);


        $repeater->add_control(
            'thumbnail',
            [
                'label' => __('Thumbnail', 'plugin-name'),
                'type' => \Elementor\Controls_Manager::MEDIA,
                'media_type' => 'image',
            ]
        );

        $repeater->add_control(
            'title',
            [
                'label' => __('Title', 'plugin-name'),
                'type' => \Elementor\Controls_Manager::TEXT,
                'default' => __('Podcast Title', 'plugin-name'),
            ]
        );

        $repeater->add_control(
            'subtitle',
            [
                'label' => __('Subtitle', 'plugin-name'),
                'type' => \Elementor\Controls_Manager::TEXT,
                'default' => __('Subtitle', 'plugin-name'),
            ]
        );

		$repeater->add_control(
            'broadcast_label',
            [
                'label' => __('Broadcast Label', 'plugin-name'),
                'type' => \Elementor\Controls_Manager::TEXT,
                'default' => __('Broadcast on:', 'plugin-name'),
                'label_block' => true,
            ]
        );

		$repeater->add_control(
            'release_date',
            [
                'label' => __('Release Date', 'plugin-name'),
                'type' => \Elementor\Controls_Manager::DATE_TIME,
                'default' => '',
                'label_block' => true,
            ]
        );

        $this->add_control(
            'podcast_items',
            [
                'label' => __('Podcast Items', 'plugin-name'),
                'type' => \Elementor\Controls_Manager::REPEATER,
                'fields' => $repeater->get_controls(),
                'default' => [],
                'title_field' => '{{{ title }}}',
            ]
        );

        $this->end_controls_section();
		
		$this->start_controls_section(
				'content_post',
				[
					'label' => __('Content Post', 'plugin-name'),
					'tab' => \Elementor\Controls_Manager::TAB_CONTENT,
				]
			);

			$this->add_control(
				'post_count',
				[
					'label' => __('Number of Posts', 'plugin-name'),
					'type' => \Elementor\Controls_Manager::NUMBER,
					'default' => 4,
				]
			);

			$this->add_control(
				'post_category',
				[
					'label' => __('Post Category', 'plugin-name'),
					'type' => \Elementor\Controls_Manager::SELECT2,
					'options' => $this->get_post_categories(),
					'multiple' => false,
					'default' => '',
				]
			);

			$this->end_controls_section();

    }
	private function get_post_categories() {
		$categories = get_terms('category');
		$category_options = [];
		if (!empty($categories)) {
			foreach ($categories as $category) {
				$category_options[$category->term_id] = $category->name;
			}
		}
		return $category_options;
	}


		protected function render() {
			$settings = $this->get_settings_for_display();

			if ($settings['podcast_items']) {
				echo '<div class="custom-podcast-faq-widget">';

				echo '<div class="faq-header">';
				echo '<div class="faq-header-image"><img src="' . esc_url($settings['author_image']['url']) . '" alt="' . esc_attr($settings['author_name']) . '"></div>';
				echo '<div class="faq-header-title">' . esc_html($settings['author_name']) . '</div>';
				echo '<div class="faq-header-arrow">';
				echo '<svg xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" width="800px" height="800px" viewBox="0 -4.5 20 20" version="1.1">
						<title>arrow_down [#338]</title>
						<desc>Created with Sketch.</desc>
						<defs></defs>
						<g id="Page-1" stroke="none" stroke-width="1" fill="none" fill-rule="evenodd">
							<g id="Dribbble-Light-Preview" transform="translate(-220.000000, -6684.000000)" fill="#000000">
								<g id="icons" transform="translate(56.000000, 160.000000)">
									<path d="M164.292308,6524.36583 L164.292308,6524.36583 C163.902564,6524.77071 163.902564,6525.42619 164.292308,6525.83004 L172.555873,6534.39267 C173.33636,6535.20244 174.602528,6535.20244 175.383014,6534.39267 L183.70754,6525.76791 C184.093286,6525.36716 184.098283,6524.71997 183.717533,6524.31405 C183.328789,6523.89985 182.68821,6523.89467 182.29347,6524.30266 L174.676479,6532.19636 C174.285736,6532.60124 173.653152,6532.60124 173.262409,6532.19636 L165.705379,6524.36583 C165.315635,6523.96094 164.683051,6523.96094 164.292308,6524.36583"></path>
								</g>
							</g>
						</g>
					</svg>';
				echo '</div>';
				echo '</div>';

				echo '<div class="faq-content" style="display:none;">';
				foreach ($settings['podcast_items'] as $item) {
					$media_type = $item['media_type'];
					$file_url = $item['file']['url'];
					$title = $item['title'];
					$subtitle = $item['subtitle'];
					$broadcast_label = $item['broadcast_label'];
					$release_date = $item['release_date'];

					if ($media_type === 'audio') {
						$thumbnail = wp_get_attachment_image_src($item['thumbnail']['id'], 'full')[0];

						echo '<div class="podcast-item podcast-audio">';
						echo '<div class="podcast-thumbnail"><img src="' . esc_url($thumbnail) . '" alt="' . esc_attr($title) . '"></div>';
						echo '<div class="podcast-info">';
						echo '<h3 class="podcast-title">' . esc_html($title) . '</h3>';
						echo '<p class="podcast-subtitle">' . esc_html($subtitle) . '</p>';
						if (!empty($release_date)) {
							echo '<p class="podcast-release-date">' . esc_html($broadcast_label) . ' ' . esc_html(date('F j, Y', strtotime($release_date))) . '</p>';
						}
						echo '<audio controls><source src="' . esc_url($file_url) . '" type="audio/mpeg"></audio>';
						echo '</div>'; // .podcast-info
						echo '</div>'; // .podcast-item
					} elseif ($media_type === 'video') {
						echo '<div class="podcast-item podcast-video">';
						echo '<div class="video-thumbnail">';
						echo '<div class="icon-play-podcast"><svg xmlns="http://www.w3.org/2000/svg" viewBox="0 0 512 512"><path d="M464 256A208 208 0 1 0 48 256a208 208 0 1 0 416 0zM0 256a256 256 0 1 1 512 0A256 256 0 1 1 0 256zM188.3 147.1c7.6-4.2 16.8-4.1 24.3 .5l144 88c7.1 4.4 11.5 12.1 11.5 20.5s-4.4 16.1-11.5 20.5l-144 88c-7.4 4.5-16.7 4.7-24.3 .5s-12.3-12.2-12.3-20.9l0-176c0-8.7 4.7-16.7 12.3-20.9z"/></svg> </div>';
						echo '<video class="video-popup-trigger" src="' . esc_url($file_url) . '" muted></video>';
						echo '</div>';
						echo '<div class="podcast-info">';
						echo '<h3 class="podcast-title">' . esc_html($title) . '</h3>';
						echo '<p class="podcast-subtitle">' . esc_html($subtitle) . '</p>';
						if (!empty($release_date)) {
							echo '<p class="podcast-release-date">' . esc_html($broadcast_label) . ' ' . esc_html(date('F j, Y', strtotime($release_date))) . '</p>';
						}
						echo '<button class="watch-now-btn video-popup-trigger" data-video="' . esc_url($file_url) . '">Watch Now</button>';
						echo '</div>'; 
						echo '</div>'; 
					}
				}
				
				if (!empty($settings['additional_card_items'])) {
					echo '<div class="additional-podcast-cards">';

						$post_count = !empty($settings['post_count']) ? intval($settings['post_count']) : 3; 
						$category_id = !empty($settings['post_category']) ? intval($settings['post_category']) : 0; 

						var_dump($post_count);
						var_dump($category_id); 

						
						$args = array(
							'posts_per_page' => $post_count,
							'category__in'   => array($category_id), 
						);

						$query = new WP_Query($args);

						if ($query->have_posts()) {
							while ($query->have_posts()) {
								$query->the_post();
								echo '<div class="additional-card-item">';
								echo '<div class="card-image" style="position: relative;">';
								echo '<img src="' . get_the_post_thumbnail_url(get_the_ID(), 'full') . '" alt="' . get_the_title() . '">';
								echo '<a class="play-link" href="' . get_the_permalink() . '">';
								echo '<svg aria-hidden="true" class="e-font-icon-svg e-fas-play" viewBox="0 0 448 512" xmlns="http://www.w3.org/2000/svg"><path d="M424.4 214.7L72.4 6.6C43.8-10.3 0 6.1 0 47.9V464c0 37.5 40.7 60.1 72.4 41.3l352-208c31.4-18.5 31.5-64.1 0-82.6z"></path></svg>';
								echo '</a>';
								echo '<p class="card-date">' . get_the_date() . '</p>';
								echo '</div>';
								echo '<div class="card-info">';
								$tag_link = get_tag_link(get_the_tags()[0]->term_id);
								echo '<div class="card-season-title">';
								echo '<a href="' . esc_url($tag_link) . '">';
								echo '<svg aria-hidden="true" class="e-font-icon-svg e-fas-headphones-alt" viewBox="0 0 512 512" xmlns="http://www.w3.org/2000/svg"><path d="M160 288h-16c-35.35 0-64 28.7-64 64.12v63.76c0 35.41 28.65 64.12 64 64.12h16c17.67 0 32-14.36 32-32.06V320.06c0-17.71-14.33-32.06-32-32.06zm208 0h-16c-17.67 0-32 14.35-32 32.06v127.88c0 17.7 14.33 32.06 32 32.06h16c35.35 0 64-28.71 64-64.12v-63.76c0-35.41-28.65-64.12-64-64.12zM256 32C112.91 32 4.57 151.13 0 288v112c0 8.84 7.16 16 16 16h16c8.84 0 16-7.16 16-16V288c0-114.67 93.33-207.8 208-207.82 114.67.02 208 93.15 208 207.82v112c0 8.84 7.16 16 16 16h16c8.84 0 16-7.16 16-16V288C507.43 151.13 399.09 32 256 32z"></path></svg>';
								echo esc_html(get_the_tags()[0]->name);
								echo '</a>';
								echo '</div>';
								echo '<h3 class="card-main-title"><a href="' . get_permalink() . '">' . get_the_title() . '</a></h3>';
								echo '</div>';
								echo '</div>';
							}
							wp_reset_postdata();
						} else {
							echo '<p>' . __('No posts found.', 'plugin-name') . '</p>';
						}


						echo '</div>'; // .additional-podcast-cards
					}
					echo '</div>'; // .faq-content
					echo '</div>'; // .custom-podcast-faq-widget
				}
			}
}

{
	"blocks": [
		{
			"type": "header",
			"text": {
				"type": "plain_text",
				"text": ":star: What's on in Melbourne this week! :star:"
			}
		},
		{
			"type": "section",
			"text": {
				"type": "mrkdwn",
				"text": "\n\n Hey Melbourne, happy Monday! Please see below for what's on this week. "
			}
		},
		{
			"type": "divider"
		},
		{
			"type": "header",
			"text": {
				"type": "plain_text",
				"text": "Xero Café :coffee:",
				"emoji": true
			}
		},
		{
			"type": "section",
			"text": {
				"type": "mrkdwn",
				"text": "\n :new-thing: *This week we are offering:* \n\n Unicorn Cookies, Rocket Ship Cookies & Vegan Choc Raspberry Slice \n\n *Weekly Café Special*: _Jaffa Latte_"
			}
		},
		{
			"type": "header",
			"text": {
				"type": "plain_text",
				"text": "Monday, 30th September :calendar-date-30:",
				"emoji": true
			}
		},
		{
			"type": "section",
			"text": {
				"type": "mrkdwn",
				"text": "Hackathon begins! We're kicking off with an office lunch from 12pm in the Level 3 Kitchen. We'll have Poke Bowls available for everyone to grab! :poke-bowl:"
			}
		},
		{
			"type": "header",
			"text": {
				"type": "plain_text",
				"text": " Wednesday, 2nd October :calendar-date-2:",
				"emoji": true
			}
		},
		{
			"type": "section",
			"text": {
				"type": "mrkdwn",
				"text": "\n\n:fruits: *Afternoon Tea*: From *2pm* in the L3 kitchen + breakout space! \n\n:yoga2:*Wellbeing - Yoga Flow*: Confirm your spot <https://docs.google.com/spreadsheets/d/1iKMQtSaawEdJluOmhdi_r_dAifeIg0JGCu7ZSPuwRbo/edit?gid=0#gid=0/|*here*>. Please note we have a maximum of 15 participants per class, a minimum notice period of 4 hours is required if you can no longer attend."
			}
		},
		{
			"type": "header",
			"text": {
				"type": "plain_text",
				"text": "Thursday, 3rd October :calendar-date-3:",
				"emoji": true
			}
		},
		{
			"type": "section",
			"text": {
				"type": "mrkdwn",
				"text": ":breakfast: *Breakfast*: Provided by *Kartel Catering* from *8:30am - 10:30am* in the Wominjeka Breakout Space.\n\n"
			}
		},
		{
			"type": "divider"
		},
		{
			"type": "section",
			"text": {
				"type": "mrkdwn",
				"text": ":connect: *Reminder - Boost Survey:* Our Boost Day feedback survey is live until the 1st of October 2024, give us your thoughts <https://yourvoice.xero.com/jfe/form/SV_eyA8ArYHfnsfUwu|*here*>. All responses are anonymous! \n\n *Later this month*: We have our Hackathon themed Social+ on the 31st of October 2024! :xero-unicorn: \n\n Stay tuned to this channel for more details, and make sure you're subscribed to the <https://calendar.google.com/calendar/u/0?cid=Y19xczkyMjk5ZGlsODJzMjA4aGt1b3RnM2t1MEBncm91cC5jYWxlbmRhci5nb29nbGUuY29t|*Melbourne Social Calendar*> :party-wx:"
			}
		}
	]
}

import time
import pygame
import pendulum

def alarm():
    pygame.mixer.init()
    pygame.mixer.music.load('alarm.mp3')
    pygame.mixer.music.play()

    while pygame.mixer.music.get_busy():
        time.sleep(1)


def set_alarm(target_time):
    while True:
        dt = pendulum.now()
        current_time = dt.strftime('%I:%M:%S %p')
        print(current_time, target_time)
        time.sleep(1)
        if current_time == target_time:
            break


target_time = '07:09:00 PM'
set_alarm(target_time)
alarm()

<button type="button">Click Me!</button>

Monochromatic Color

url = "https://api-demo.sambasafety.io/oauth2/v1/token";
	headers = {
		"x-api-key": "WJDBWMdYFX3FbAlf3WY8DWBzaG3MaQI9SPbWE0j7",
		"Content-Type": "application/x-www-form-urlencoded",
		"Authorization": "Basic MG9hMTl5Yjlod2dyU3VnNVMzNTg6ZHBvNGFYLWZlWFBqQ2tHanF1YjgwdTc2OG5PY0pUQ3ZGSmtlOTVXUkc2RVFNbWdmMlQxWlUzOUthOEEtT0dnMA=="
	};
	params = map();
	params.put("grant_type", "client_credentials");
	params.put("scope", "API");
	x = invokeurl
	[
		url: url
		type: POST 
		parameters:params
		headers: headers
];
//info x;
access_token = x.get("access_token");
/////////////////////////////////////////////
/////////////////////////////////////////////////////////

url = "https://api-demo.sambasafety.io/organization/v1/groups/92790";
headers = {
    "x-api-key": "WJDBWMdYFX3FbAlf3WY8DWBzaG3MaQI9SPbWE0j7",
    "Content-Type": "application/x-www-form-urlencoded",
    "Authorization": "Bearer " + access_token 
};

x = invokeurl
[
    url: url
    type: get
    headers: headers
];

info x;

add_filter( 'woocommerce_get_image_size_gallery_thumbnail', function( $size ) {
	return array(
		'width'  => 400,
		'height' => 400,
		'crop'   => 1,
	);
} );

import numpy as np
import math
from typing import Tuple
import pandas as pd
import os
from PIL import Image
import shutil

CLASS_COLORS = {
    0: {'color_rgb': (0, 0, 0), 'label': 'background'},
    1: {'color_rgb': (255, 0, 0), 'label': 'chondroosseous border'},
    2: {'color_rgb': (0, 255, 0), 'label': 'femoral head'},
    3: {'color_rgb': (0, 0, 255), 'label': 'labrum'},
    4: {'color_rgb': (255, 255, 0), 'label': 'cartilagineous roof'},
    5: {'color_rgb': (0, 255, 255), 'label': 'bony roof'},
    6: {'color_rgb': (159, 2, 250), 'label': 'bony rim'},
    7: {'color_rgb': (255, 132, 0), 'label': 'lower limb'},
    8: {'color_rgb': (255, 0, 255), 'label': 'baseline'},
    9: {'color_rgb': (66, 135, 245), 'label': 'lower limb template'},
    10: {'color_rgb': (255, 69, 0), 'label': 'lower limb - alg. v3'}
}

def detect_bump(mask: np.ndarray, skip: int = 15, threshold: int = 5) -> int:
    """
    Wykrywa garb na bony roof. Zwraca 1, jeśli garb wykryto, w przeciwnym wypadku 0.
    """
    label_bony_roof = 5
    binary_mask = (mask == label_bony_roof).astype(np.uint8)

    height, width = binary_mask.shape
    upper_contour = []

    for x in range(width):
        column = binary_mask[:, x]
        if np.any(column):
            y = np.where(column)[0][0] 
            upper_contour.append((x, y))
        else:
            upper_contour.append((x, np.nan))

    print(f"Upper contour (pierwsze 10 punktów): {upper_contour[:10]}")

    # Odfiltrowanie wartości NaN (kolumn bez bony roof)
    valid_contour = np.array([y for x, y in upper_contour if not np.isnan(y)])

    if len(valid_contour) == 0:
        print("Brak pikseli bony roof")
        return 0
    
    min_y = np.min(valid_contour)

    print(f"Najwyższy punkt (min_y): {min_y}")

    distances = valid_contour - min_y
    
    print(f"Odległości od najwyższego punktu (pierwsze 10): {distances[:10]}")

    differences = pd.Series(distances).diff(periods=skip).diff().fillna(0).abs()

    print(f"Pierwsze 3 różnice z różnic: {differences[:3].values}")
    max_diff = differences.max()
    print(f"Max różnica: {max_diff}")

    return 1 if max_diff >= threshold else 0

def process_masks_and_save_with_visualization(mask_dir, bump_dir, no_bump_dir, skip=7, threshold=6):
    """
    Przetwarza maski, wykrywa obecność garbu, zapisuje je do odpowiednich folderów 
    i tworzy ich wizualizacje.
    """
    if not os.path.exists(bump_dir):
        os.makedirs(bump_dir)
    if not os.path.exists(no_bump_dir):
        os.makedirs(no_bump_dir)

    for filename in os.listdir(mask_dir):
        file_path = os.path.join(mask_dir, filename)
        
        if os.path.isfile(file_path) and filename.endswith('.png'):
            mask = Image.open(file_path).convert('L')  # Konwertuj do odcieni szarości
            mask_np = np.array(mask)
            
            # Wykrycie garbu
            bump_present = detect_bump(mask_np, skip, threshold)
            
            # Obliczanie max_diff
            label_bony_roof = 5
            binary_mask = (mask_np == label_bony_roof).astype(np.uint8)
            height, width = binary_mask.shape
            upper_contour = []

            for x in range(width):
                column = binary_mask[:, x]
                if np.any(column):
                    y = np.where(column)[0][0]  # Najwyższy piksel w danej kolumnie
                    upper_contour.append(y)
                else:
                    upper_contour.append(height)

            upper_contour = np.array(upper_contour)
            min_y = np.min(upper_contour)
            distances = min_y - upper_contour
            differences = pd.Series(distances).diff(periods=skip).fillna(0).abs()
            max_diff = differences.max()
            
            # Wizualizacja maski
            visualized_image = np.zeros((height, width, 3), dtype=np.uint8)
            
            for label, color_info in CLASS_COLORS.items():
                color = color_info['color_rgb']
                visualized_image[mask_np == label] = color

            # Zapisanie do odpowiedniego folderu
            if bump_present:
                save_path = os.path.join(bump_dir, filename)
            else:
                save_path = os.path.join(no_bump_dir, filename)

            Image.fromarray(visualized_image).save(save_path)
            print(f'Zapisano zwizualizowaną maskę do: {save_path} - max_diff: {max_diff}')


process_masks_and_save_with_visualization('./Angles/dane/masks', './Angles/dane/garb_obecny','./Angles/dane/garb_nieobecny')

add_filter( 'woocommerce_get_image_size_single', function( $size ) {
	return array(
		'width'  => 500,
		'height' => 500,
		'crop'   => 1,
	);
} );

add_filter( 'woocommerce_get_image_size_thumbnail', function( $size ) {
	return array(
		'width'  => 500,
		'height' => 500,
		'crop'   => 1,
	);
} );

        PM2 is a Production Process Manager for Node.js applications
                     with a built-in Load Balancer.

                Start and Daemonize any application:
                $ pm2 start app.js

                Load Balance 4 instances of api.js:
                $ pm2 start api.js -i 4

                Monitor in production:
                $ pm2 monitor

                Make pm2 auto-boot at server restart:
                $ pm2 startup

                To go further checkout:
                http://pm2.io/

function add_gtm_script() {
    ?>
    <!-- Google Tag Manager -->
    <script>
    (function(w,d,s,l,i){w[l]=w[l]||[];w[l].push({'gtm.start': new Date().getTime(),event:'gtm.js'});
    var f=d.getElementsByTagName(s)[0], j=d.createElement(s), dl=l!='dataLayer'?'&l='+l:'';
    j.async=true; j.src='https://www.googletagmanager.com/gtm.js?id='+i+dl;
    f.parentNode.insertBefore(j,f);
    })(window,document,'script','dataLayer','GTM-WXR2BQ93');
    </script>
    <!-- End Google Tag Manager -->
    <?php
}
add_action('wp_head', 'add_gtm_script');
function add_gtm_noscript() {
    ?>
    <!-- Google Tag Manager (noscript) -->
    <noscript>
        <iframe src="https://www.googletagmanager.com/ns.html?id=GTM-WXR2BQ93"
        height="0" width="0" style="display:none;visibility:hidden"></iframe>
    </noscript>
    <!-- End Google Tag Manager (noscript) -->
    <?php
}
add_action('wp_body_open', 'add_gtm_noscript');

<div class="switch">
    <input id="checkbox1" class="look" type="checkbox">
    <label for="checkbox1"></label>
</div>

.switch {
position: relative;
}

.switch label {
width: 55px;
height: 23px;
background-color: #999;
position: absolute;
top: 0;
left: 0;
border-radius: 50px;
}

.switch input[type="checkbox"] {
visibility: hidden;
}

.switch label:after {
content: '';
width: 21px;
height: 21px;
border-radius: 50px;
position: absolute;
top: 1px;
left: 1px;
transition: 100ms;
background-color: white;
}

.switch .look:checked + label:after {
left: 32px;
}

.switch .look:checked + label {
background-color: lightsteelblue;
}

//Disabling Automatic Scrolling On All Gravity Forms
add_filter( 'gform_confirmation_anchor', '__return_false' );

//Aim is to divide the list recursively into smaller sublists
//until each sublist conatins only 1 element or no elements
function merge_sort(xs) {
    if (is_null(xs) || is_null(tail(xs))){
        return xs;
    } else {
        const mid = middle(length(xs)); // to find value of half
        return merge (merge_sort(take(xs,mid)), merge_sort(drop(xs, mid)));
    }
}

//Aim is to combine two sorted sublists into a single sorted sublist
function merge(xs,ys){
    if (is_null(xs)) {
        return ys;
    } else if (is_null(ys)) {
        return xs;
    } else {
        const x = head(xs);
        const y = head(ys);
        return x < y
               ? pair(x, merge(tail(xs), ys))
               : pair(y, merge(xs, tail(ys)));
    }
}

//Half rounded downwards
function middle(n){
    return math_floor(n/2);
}

//Take first n elements of list
function take(xs,n){
    return n===0
           ? null 
           : pair(head(xs), take(tail(xs), n-1));
}
//Drop first n elements of list, return the rest         
function drop(xs, n){
    return n === 0
           ? xs
           : drop(tail(xs), n-1);
}


// Test
merge_sort(list(7, 6, 3, 8, 4, 6, 5, 9, 8, 3, 1, 5, 2));

We've disabled your account
You no longer have access to curtisfrederickkennethbarry
Account disabled on 28 August 2024

elem {
    width: 100%;
    width: -moz-available;          /* WebKit-based browsers will ignore this. */
    width: -webkit-fill-available;  /* Mozilla-based browsers will ignore this. */
    width: fill-available;
}

elem {
    height: 100%;
    height: -moz-available;          /* WebKit-based browsers will ignore this. */
    height: -webkit-fill-available;  /* Mozilla-based browsers will ignore this. */
    height: fill-available;
}

DISM /Online /Cleanup-Image /StartComponentCleanup /ResetBase

#include <iostream>
#include <string>
#include <set>

using namespace std;

int minimumNumber(int n, const string& password) {
    // Define character sets
    const string numbers = "0123456789";
    const string lower_case = "abcdefghijklmnopqrstuvwxyz";
    const string upper_case = "ABCDEFGHIJKLMNOPQRSTUVWXYZ";
    const string special_characters = "!@#$%^&*()-+";

    // Flags to check the presence of required character types
    bool has_digit = false;
    bool has_lower = false;
    bool has_upper = false;
    bool has_special = false;

    // Check for each character in the password
    for (char ch : password) {
        if (numbers.find(ch) != string::npos) has_digit = true;
        else if (lower_case.find(ch) != string::npos) has_lower = true;
        else if (upper_case.find(ch) != string::npos) has_upper = true;
        else if (special_characters.find(ch) != string::npos) has_special = true;
    }

    // Count how many character types are missing
    int missing_types = 0;
    if (!has_digit) missing_types++;
    if (!has_lower) missing_types++;
    if (!has_upper) missing_types++;
    if (!has_special) missing_types++;

    // Calculate the total number of characters needed
    int total_needed = max(6 - n, 0); // Length requirement
    return max(missing_types, total_needed);
}

int main() {
    int n;
    cin >> n; // Length of the password
    string password;
    cin >> password; // The password string

    int result = minimumNumber(n, password);
    cout << result << endl; // Output the minimum number of characters to add

    return 0;
}

#include <iostream>
#include <string>

using namespace std;

int camelcase(const string& s) {
    int wordCount = 1; // Start with 1 to account for the first word
    
    for (char ch : s) {
        if (isupper(ch)) {
            wordCount++; // Increment the count for every uppercase letter
        }
    }

    return wordCount;
}

int main() {
    string s;
    cin >> s; // Input the CamelCase string
    cout << camelcase(s) << endl; // Output the number of words
    return 0;
}

#include <iostream>
#include <string>
#include <cctype>

using namespace std;

string checkPangram(const string& sentence) {
    bool letters[26] = {false}; 

    for (char ch : sentence) {
        if (isalpha(ch)) {
            int index = tolower(ch) - 'a';
            letters[index] = true; // Mark this letter as present
        }
    }

    for (bool present : letters) {
        if (!present) {
            return "not pangram";
        }
    }

    return "pangram";
}

int main() {
    string input;
    getline(cin, input);
    cout << checkPangram(input) << endl;
    return 0;
}

#include <iostream>
#include <vector>
#include <algorithm>
#include <climits> // Include this header to use INT_MAX

using namespace std;

vector<int> closestNumbers(vector<int>& arr) {
    vector<int> result;
    sort(arr.begin(), arr.end()); // Step 1: Sort the array

    int minDiff = INT_MAX; // Initialize minDiff to a large value

    // Step 2: Find the smallest absolute difference
    for (size_t i = 0; i < arr.size() - 1; ++i) {
        int diff = arr[i + 1] - arr[i];
        if (diff < minDiff) {
            minDiff = diff;
        }
    }

    // Step 3: Collect pairs with the smallest difference
    for (size_t i = 0; i < arr.size() - 1; ++i) {
        int diff = arr[i + 1] - arr[i];
        if (diff == minDiff) {
            result.push_back(arr[i]);
            result.push_back(arr[i + 1]);
        }
    }

    return result;
}

int main() {
    int n;
    cin >> n;
    vector<int> arr(n);

    for (int i = 0; i < n; ++i) {
        cin >> arr[i];
    }

    vector<int> result = closestNumbers(arr);

    for (int num : result) {
        cout << num << " ";
    }
    cout << endl;

    return 0;
}

#include <iostream>
#include <vector>

using namespace std;

vector<int> quickSort(const vector<int>& arr) {
    int pivot = arr[0];
    vector<int> left, middle, right;

    // Partitioning the array
    for (int i = 1; i < arr.size(); i++) {
        if (arr[i] < pivot) {
            left.push_back(arr[i]);
        } else {
            right.push_back(arr[i]);
        }
    }

    middle.push_back(pivot); // Add the pivot to the middle
    // Combine left, middle, and right
    left.insert(left.end(), middle.begin(), middle.end());
    left.insert(left.end(), right.begin(), right.end());

    return left;
}

int main() {
    int n;
    cin >> n; // Size of the array
    vector<int> arr(n);
    
    // Input array
    for (int i = 0; i < n; i++) {
        cin >> arr[i];
    }
    
    // Get the partitioned array
    vector<int> result = quickSort(arr);

    // Output the result
    for (int num : result) {
        cout << num << " ";
    }
    cout << endl;

    return 0;
}

#include <iostream>
#include <vector>

using namespace std;

vector<int> quickSort(const vector<int>& arr) {
    int pivot = arr[0];
    vector<int> left, middle, right;

    // Partitioning the array
    for (int i = 1; i < arr.size(); i++) {
        if (arr[i] < pivot) {
            left.push_back(arr[i]);
        } else {
            right.push_back(arr[i]);
        }
    }

    middle.push_back(pivot); // Add the pivot to the middle
    // Combine left, middle, and right
    left.insert(left.end(), middle.begin(), middle.end());
    left.insert(left.end(), right.begin(), right.end());

    return left;
}

int main() {
    int n;
    cin >> n; // Size of the array
    vector<int> arr(n);
    
    // Input array
    for (int i = 0; i < n; i++) {
        cin >> arr[i];
    }
    
    // Get the partitioned array
    vector<int> result = quickSort(arr);

    // Output the result
    for (int num : result) {
        cout << num << " ";
    }
    cout << endl;

    return 0;
}

# Press Win+R to open the Run prompt and enter this value:

shell:::{05d7b0f4-2121-4eff-bf6b-ed3f69b894d9}

# Tick the Always show all icons and notifications on the taskbar checkbox and click the OK button.

#include <iostream>

struct SinglyLinkedListNode {
    int data;
    SinglyLinkedListNode* next;
    SinglyLinkedListNode(int val) : data(val), next(nullptr) {}
};

int compare_lists(SinglyLinkedListNode* llist1, SinglyLinkedListNode* llist2) {
    while (llist1 != nullptr && llist2 != nullptr) {
        if (llist1->data != llist2->data) {
            return 0; // Lists are not equal
        }
        llist1 = llist1->next;
        llist2 = llist2->next;
    }
    
    // Check if both lists have reached the end
    if (llist1 == nullptr && llist2 == nullptr) {
        return 1; // Lists are equal
    } else {
        return 0; // One list is longer than the other
    }
}

int main() {
    int t;
    std::cin >> t; // Number of test cases
    while (t--) {
        int n1;
        std::cin >> n1; // Number of nodes in the first list
        SinglyLinkedListNode* llist1 = nullptr;
        SinglyLinkedListNode* tail1 = nullptr;
        
        for (int i = 0; i < n1; ++i) {
            int value;
            std::cin >> value;
            SinglyLinkedListNode* newNode = new SinglyLinkedListNode(value);
            if (llist1 == nullptr) {
                llist1 = newNode;
                tail1 = newNode;
            } else {
                tail1->next = newNode;
                tail1 = newNode;
            }
        }

        int n2;
        std::cin >> n2; // Number of nodes in the second list
        SinglyLinkedListNode* llist2 = nullptr;
        SinglyLinkedListNode* tail2 = nullptr;

        for (int i = 0; i < n2; ++i) {
            int value;
            std::cin >> value;
            SinglyLinkedListNode* newNode = new SinglyLinkedListNode(value);
            if (llist2 == nullptr) {
                llist2 = newNode;
                tail2 = newNode;
            } else {
                tail2->next = newNode;
                tail2 = newNode;
            }
        }

        std::cout << compare_lists(llist1, llist2) << std::endl;

        // Clean up memory (optional but good practice)
        // (You should implement a function to delete the linked list nodes)
    }

    return 0;
}

#include <iostream>
#include <stack>
using namespace std;

class QueueUsingStacks {
private:
    stack<int> enqueueStack;
    stack<int> dequeueStack;

    void transferToDequeueStack() {
        // Move elements from enqueueStack to dequeueStack
        while (!enqueueStack.empty()) {
            dequeueStack.push(enqueueStack.top());
            enqueueStack.pop();
        }
    }

public:
    void put(int value) {
        enqueueStack.push(value);
    }

    void pop() {
        if (dequeueStack.empty()) {
            transferToDequeueStack();
        }
        if (!dequeueStack.empty()) {
            dequeueStack.pop();
        }
    }

    int peek() {
        if (dequeueStack.empty()) {
            transferToDequeueStack();
        }
        return dequeueStack.top();
    }
};

int main() {
    int q;
    cin >> q;
    QueueUsingStacks queue;

    for (int i = 0; i < q; ++i) {
        int queryType;
        cin >> queryType;

        if (queryType == 1) {
            int value;
            cin >> value;
            queue.put(value);
        } else if (queryType == 2) {
            queue.pop();
        } else if (queryType == 3) {
            cout << queue.peek() << endl;
        }
    }

    return 0;
}

#include <iostream>
#include <vector>
#include <queue>
#include <set>
using namespace std;

struct Position {
    int x, y, moves;
};

int minimumMoves(const vector<string>& grid, int startX, int startY, int goalX, int goalY) {
    int n = grid.size();
    vector<pair<int, int>> directions = {{0, 1}, {1, 0}, {0, -1}, {-1, 0}}; // Right, Down, Left, Up
    queue<Position> q;
    set<pair<int, int>> visited;

    q.push({startX, startY, 0});
    visited.insert({startX, startY});

    while (!q.empty()) {
        Position current = q.front();
        q.pop();

        // Check if we reached the goal
        if (current.x == goalX && current.y == goalY) {
            return current.moves;
        }

        // Explore in all four directions
        for (auto& dir : directions) {
            int nx = current.x, ny = current.y;

            // Move until hitting a boundary or a blocked cell
            while (nx + dir.first >= 0 && nx + dir.first < n &&
                   ny + dir.second >= 0 && ny + dir.second < n &&
                   grid[nx + dir.first][ny + dir.second] == '.') {
                nx += dir.first;
                ny += dir.second;

                // If we reach the goal during the movement
                if (nx == goalX && ny == goalY) {
                    return current.moves + 1;
                }

                // If this position hasn't been visited
                if (visited.find({nx, ny}) == visited.end()) {
                    visited.insert({nx, ny});
                    q.push({nx, ny, current.moves + 1});
                }
            }
        }
    }

    // If we exit the loop without having found the goal
    return -1; // Return -1 if the goal is unreachable
}

int main() {
    int n;
    cin >> n;
    vector<string> grid(n);
    for (int i = 0; i < n; ++i) {
        cin >> grid[i];
    }
    int startX, startY, goalX, goalY;
    cin >> startX >> startY >> goalX >> goalY;

    cout << minimumMoves(grid, startX, startY, goalX, goalY) << endl;

    return 0;
}

#include <iostream>
#include <stack>
#include <string>
#include <unordered_map>

using namespace std;

string isBalanced(string s) {
    // Mapping of closing brackets to their corresponding opening brackets
    unordered_map<char, char> bracketMap = {
        {')', '('},
        {']', '['},
        {'}', '{'}
    };
    
    stack<char> stk;
    
    for (char ch : s) {
        // If it's an opening bracket, push it onto the stack
        if (bracketMap.find(ch) == bracketMap.end()) {
            stk.push(ch);
        } 
        // If it's a closing bracket
        else {
            // Check if the stack is empty or the top of the stack doesn't match
            if (stk.empty() || stk.top() != bracketMap[ch]) {
                return "NO";
            }
            // Pop the matching opening bracket
            stk.pop();
        }
    }
    
    // If the stack is empty, all brackets matched correctly
    return stk.empty() ? "YES" : "NO";
}

int main() {
    int n;
    cin >> n; // Read the number of strings
    cin.ignore(); // Ignore the newline after the number input

    for (int i = 0; i < n; ++i) {
        string s;
        getline(cin, s); // Read each bracket string
        cout << isBalanced(s) << endl; // Output YES or NO
    }
    
    return 0;
}

#include <iostream>
#include <vector>
using namespace std;

int twoStacks(int maxSum, const vector<int>& a, const vector<int>& b) {
    int sum = 0, count = 0, i = 0, j = 0;


    while (i < a.size() && sum + a[i] <= maxSum) {
        sum += a[i];
        i++;
    }

    
    count = i;

    
    while (j < b.size() && i >= 0) {
        sum += b[j];
        j++;
        
        
        while (sum > maxSum && i > 0) {
            i--;
            sum -= a[i];
        }

        
        if (sum <= maxSum) {
            count = max(count, i + j);
        }
    }

    return count;
}

int main() {
    int g;
    cin >> g;

    while (g--) {
        int n, m, maxSum;
        cin >> n >> m >> maxSum;
        
        vector<int> a(n);
        vector<int> b(m);
        
        for (int i = 0; i < n; i++) {
            cin >> a[i];
        }
        
        for (int i = 0; i < m; i++) {
            cin >> b[i];
        }
        
        cout << twoStacks(maxSum, a, b) << endl;
    }

    return 0;
}

#include <iostream>
#include <list>

using namespace std;

int main()
{
    list<int> a,b,c;
    long A = 0, B = 0, C = 0, x = 0, num[3];
    int height = 0;

    cin >> num[0] >> num[1] >> num[2];

    while(num[0]--){
        cin >> height;
        a.push_back(height);
        A += height;
    }

  
    while(num[1]--){
        cin >> height;
        b.push_back(height);
        B += height;
    }

 
    while(num[2]--){
        cin >> height;
        c.push_back(height);
        C += height;
    }

    list<int> :: iterator itr1, itr2, itr3;

    itr1 = a.begin();
    itr2 = b.begin();
    itr3 = c.begin();

    while(A != B || B != C){
    
        x = max(A,B);
        x = max(x,C);

 
        if(A == x){
            A -=(*itr1);
            ++itr1;
        }
        if(B == x){
            B -= (*itr2);
            ++itr2;
        }
        if(C == x){
            C -= (*itr3);
            ++itr3;
        }
    }

 
    cout << A << endl;

    return 0;
}

 </li>
      <li class="nav-item dropdown">
        <a href="#movies" class="nav-link dropdown-toggle" data-toggle="dropdown">Movies</a>
        <div class="dropdown-menu"></div>
        <a href="#videos" class="nav-link" data-toggle="tab">meri</a>
        <a href="#videos" class="nav-link" data-toggle="tab">krriirr</a>
        <a href="#videos" class="nav-link" data-toggle="tab">Vttts</a>

      </li>
    </ul>

Key Differences
Architecture:

bull: Uses Redis as a backend, which makes it simpler to set up and use for job queuing and background processing.
Kafka: Requires a more complex setup with Kafka brokers and Zookeeper, designed for distributed, high-throughput messaging.
Use Cases:

bull: Ideal for background job processing, task scheduling, and handling asynchronous tasks in Node.js applications.
Kafka: Ideal for real-time data streaming, event sourcing, and building scalable, distributed systems.
Scalability:

bull: Suitable for small to medium-scale applications. Limited by the scalability of Redis.
Kafka: Designed for large-scale, high-availability applications. Can handle millions of messages per second.
Complexity:

bull: Easier to set up and use, especially for Node.js developers.
Kafka: More complex to set up and manage, but offers more powerful features for distributed messaging.
Example Use Cases
bull:

Background job processing (e.g., sending emails, processing images).
Task scheduling (e.g., cron jobs).
Rate limiting and job prioritization.
Kafka:

Real-time data pipelines (e.g., log aggregation, metrics collection).
Event sourcing and CQRS.
Stream processing (e.g., real-time analytics, monitoring).
Conclusion
Use bull if you need a simple, easy-to-use job queue for background processing in a Node.js application.
Use Kafka if you need a robust, distributed streaming platform for handling large volumes of data and building real-time data pipelines.

pip list --outdated --format=freeze | grep -v '^\-e' | cut -d = -f 1  | xargs -n1 pip install -U

<!DOCTYPE html>
<html>
<head>
  <title>Tab Navigation</title>
  <link rel="stylesheet" href="https://cdn.jsdelivr.net/npm/bootstrap@4.6.2/dist/css/bootstrap.min.css">
  <script src="https://cdn.jsdelivr.net/npm/jquery@3.5.1/dist/jquery.slim.min.js"></script>
  <script src="https://cdn.jsdelivr.net/npm/popper.js@1.16.1/dist/umd/popper.min.js"></script>
  <script src="https://cdn.jsdelivr.net/npm/bootstrap@4.6.2/dist/js/bootstrap.min.js"></script>
</head>
<body>
  <div class="container">
    <ul class="nav nav-tabs">
      <li class="nav-item">
        <a href="#home" class="nav-link active" data-toggle="tab">Home</a>
      </li>
      <li class="nav-item">
        <a href="#image" class="nav-link" data-toggle="tab">Images</a>
      </li>
      <li class="nav-item">
        <a href="#contact" class="nav-link" data-toggle="tab">Contact</a>
      </li>
      <li class="nav-item">
        <a href="#videos" class="nav-link" data-toggle="tab">Videos</a>
      </li>
      <li class="nav-item">
        <a href="#movies" class="nav-link" data-toggle="tab">Movies</a>
      </li>
    </ul>
    <div class="tab-content">
      <div id="home" class="tab-pane active">
        <div class="jumbotron">
          <h1>Welcome to Home</h1>
        </div>
      </div>
      <div id="image" class="tab-pane">
        <div class="jumbotron">
          <h1>Welcome to Images</h1>
        </div>
      </div>
      <div id="contact" class="tab-pane">
        <div class="jumbotron">
          <h1>Contact Us</h1>
        </div>
      </div>
      <div id="videos" class="tab-pane">
        <div class="jumbotron">
          <h1>Videos</h1>
        </div>
      </div>
      <div id="movies" class="tab-pane">
        <div class="jumbotron">
          <h1>Movies</h1>
        </div>
      </div>
    </div>
  </div>
</body>
</html>